package uk.org.landeg.euler.problems.unported;

/**
 * ***INCOMPLETE***
 * @author Andy
 *
 */
public class Euler145 extends AbstractProblem {
	@Override
	public String solve() {
		long sum;
		long idx = 10;
		long count = 0;
		while (idx < 1000) {
			sum = idx;
			sum += (int)Utils.reverseNumber(idx);
			if (Utils.checkDigitParity(sum, false)) {
				System.out.println(idx + "\t" + sum);
				count++;
			}
			if (idx % 1000000 == 0) {
				System.out.println(">>"+ idx + "(" + count + ")");
			}
			idx++;
		}
		System.out.println(count);
		return null;
	}

	public static void main(String[] args) {
		new Euler145().solve();
	}
}
